The dual network theorem for static flow networks and its application for maximising the throughput flow

The paper discuses a new fundamental result in the theory of flow networks referred to as the ‘dual network theorem for static flow networks’. The theorem states that the maximum throughput flow in any static network is equal to the sum of the capacities of the edges coming out of the source, minus the total excess flow at all excess nodes, plus the maximum throughput flow in the dual network. For very few imbalanced nodes in a flow network, determining the throughput flow in the dual network is a task significantly easier than determining the throughput flow in the original network. This creates the basis of a very efficient algorithm for maximising the throughput flow in a network, by maximising the throughput flow in its dual network. Consequently, a new algorithm for maximising the throughput flow in a network has been proposed. For networks with very few imbalanced nodes, in the case where only the maximum throughput flow is of interest, the proposed algorithm will outperform any classical method for determining the maximum throughput flow. In this paper we also raise awareness of a fundamental flaw in classical algorithms for maximising the throughput flow in static networks with directed edges. Despite the years of intensive research on static flow networks, the classical algorithms leave undesirable directed loops of flow in the optimised networks. These directed flow loops are associated with wastage of energy and resources and increased levels of congestion in the optimised networks. Consequently, an algorithm is also proposed for discovering and removing directed loops of flow in networks.